random walk

Terms from Artificial Intelligence: humans at the heart of algorithms

Page numbers are for draft copy at present; they will be replaced with correct numbers when final book is formatted. Chapter numbers are correct and will not change now.

A random walk is the result of summing a series of independent data items, often 1/-1 values, or a Normal distribution with mean zero. It is sometimes also called a drunkard's walk as it effiectively meanders randomly.

Used on Chap. 4: page 76